Counterexample-Preserving Reduction for Symbolic Model Checking
نویسندگان
چکیده
منابع مشابه
Counterexample-Preserving Reduction for Symbolic Model Checking
The cost of LTL model checking is highly sensitive to the length of the formula under verification. We observe that, under some specific conditions, the input LTL formula can be reduced to an easier-tohandle one before model checking. In our reduction, these two formulae need not to be logically equivalent, but they share the same counterexample set w.r.t the model. In the case that the model i...
متن کاملCounterexample-Driven Model Checking
The generation of counterexamples is frequently touted as one of the primary advantages of model checking as a verification technique. However, the generation of trace-like counterexamples is limited to a small fragment of branching-time temporal logic. When model checking does succeed in verifying a property, there is typically no independently checkable witness that can be used as evidence fo...
متن کاملSymbolic Model Checking Commitment Protocols Using Reduction
Using model checking to verify that interaction protocols have given properties is widely recognized as an important issue in multiagent systems where autonomous and heterogeneous agents need to successfully regulate and coordinate their interactions. In this paper, we investigate the use of symbolic model checkers to verify the compliance of a special kind of interaction protocols called commi...
متن کاملCombining Symmetry Reduction and Under-Approximation for Symbolic Model Checking
This work presents a collection of methods integrating symmetry reduction under approximation and symbolic model checking in order to reduce space and time for model checking The main goal of this work is falsi cation However under certain conditions our methods provide veri cation as well We rst present algorithms that perform on the y model checking for tempo ral safety properties using symme...
متن کاملDistributed CTL Model-Checking and counterexample search
In this paper, we propose a distributed algorithm for CTL model-checking and a counterexample search whenever the CTL formula is not satisfied. The distributed approach is used in order to cope with the state space explosion problem. A cluster of workstations performs collaborative verification over a partitioned state space. Thus, every process involved in the distributed verification executes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/702165